Locally Computable UOWHF with Linear Shrinkage
نویسندگان
چکیده
منابع مشابه
Locally Computable Enumerations
This paper is an extended and modiied version of 10]. A protocol with local rules is presented for enumerating anonymous nodes of nite graphs. It is proved that such algorithms do not exists for the class of ambiguous graphs, deened in the paper; the proposed algorithm works successfully for remaining non-ambiguous graphs. It is also proved that protocol is fair, which means that no enumeration...
متن کاملLocally Computable Structures
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finitely generated substructures of S effectively. Our discussion emphasizes definitions and examples, but does prove two significant results. First, our notion of mextensional local computability of S ensures that the Σn-t...
متن کاملComputable choice functions for computable linear orderings
One direction of research in computability theory is the study of the effective content of combinatorial theorems. The last chapter of Rosenstein’s book [2] reports on this type of investigation for linear orderings. Questions raised in that chapter have been the subject of a number of papers, and a summary of results in the area can be found in Downey [1]. In this paper, we consider the proble...
متن کاملConstructing Locally Connected Non-computable Julia Sets
A locally connected quadratic Siegel Julia set has a simple explicit topological model. Such a set is computable if there exists an algorithm to draw it on a computer screen with an arbitrary resolution. We constructively produce parameter values for Siegel quadratics for which the Julia sets are non-computable, yet locally connected.
متن کاملOn computable self-embeddings of computable linear orderings
Wemake progress toward solving a long-standing open problem in the area of computable linear orderings by showing that every computable η-like linear ordering without an infinite strongly η-like interval has a computable copy without nontrivial computable self-embedding. The precise characterization of those computable linear orderings which have computable copies without nontrivial computable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2016
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-016-9232-x